A Novel Prefix Cache with Two-Level Bloom Filters in IP Address Lookup
نویسندگان
چکیده
منابع مشابه
A Time Efficient Algorithm Based on Bloom Filters for Longest Prefix Matching in IP Lookups
A time efficient algorithm based on Bloom filters is proposed to solve the problem of longest prefix matching in IP lookups. It is distinguished from the existing algorithms by three features. Firstly, a first-byte indexing table is established before querying the Bloom filters, so that the impact of positive false inherent to Bloom filters on IP lookups is reduced. Secondly, only twelve Bloom ...
متن کاملA Pipelined Indexing Hash Table using Bloom and Fingerprint Filters for IP Lookup
Since achieving a scalable IP lookup has been a critical data path for high-speed routers, such a HT with a predictable lookup throughput for a large prefix table is desirable for these routers. In this paper, we propose a pipelined indexing hash table (PIHT) by using both pipelined BFs in binary search for a key’s fingerprint and a fingerprint filter for memory-efficient approximate match. For...
متن کاملIP-address lookup using LC-tries
There has recently been a notable interest in the organization of routing information to enable fast lookup of IP addresses. The interest is primarily motivated by the goal of building multi-Gb/s routers for the Internet, without having to rely on multi-layer switching techniques. We address this problem by using an LC-trie, a trie structure with combined path and level compression. This data s...
متن کاملIP-Address Lookup Using Hardware Pipelining
Fast IP address lookup mechanism is a major design issue for the next generation routers. The existing scheme performs the IP address lookup by hardware in which the forwarding table can be compressed to fit into reasonable-size SRAM, and a lookup can be accomplished in three memory accesses. In this article, we claim that with a little extra memory, it is able to further reduce the lookup time...
متن کاملUniversit a Di Pisa Ip Address Lookup Made Fast and Simple Ip Address Lookup Made Fast and Simple
The IP address lookup problem is one of the major bottlenecks in high performance routers. Previous solutions to this problem rst describe it in the general terms of longest preex matching and, then, are experimented on real routing tables T. In this paper, we follow the opposite direction. We start out from the experimental analysis of real data and, based upon our ndings, we provide a new and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2020
ISSN: 2076-3417
DOI: 10.3390/app10207198